Parallel Iterative Time Domain Decompositions Based on Deferred Correc- Tion Methods for Solving Ode Systems

نویسندگان

  • David Guibert
  • Damien Tromeur-Dervout
چکیده

The development of large computational resources leads to search for parallel implementation not only based on space decomposition. In this talk we will propose to combine time domain decomposition and the simple deferred correction. The deferred correction [1, 2] builds a perturbated problemwhich the exact solution is known. The defect difference between the perturbated solution and the solution of the original problem, is computed by a process increasing the time accurary at each iteration. The iterative correction is computed sequentially on each time steps. To introduce parallelism, we gather the time steps into subdomains distributed among processors. A parallel pipe is then defined as: a processor computes its correction, sends it to the next subdomain and starts its next iteration. Hence a cyclic distribution of the time subdomains is introduced to reduced the startup of the first step of the iterated correction process. Numerical results and parallel efficiency will be presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the generic parallelisation of iterative solvers for the finite element method

The numerical solution of partial differential equations frequently requires solving large and sparse linear systems. When using the Finite Element Method these systems exhibit a natural block structure that is exploited for efficiency in the “Iterative Solver Template Library” (ISTL). Based on existing sequential preconditioned iterative solvers we present an abstract parallelisation approach ...

متن کامل

Pii: 0045-7825(96)01024-9

Mesh partitioning is often the preferred approach for solving unstructured computational mechanics problems on massively parallel processors. Research in this area has focused so far on the automatic generation of subdomains with minimum interface points. In this paper, we address this issue and emphasize other aspects of the partitioning problem including the fast generation of large-scale mes...

متن کامل

A New Two-stage Iterative Method for Linear Systems and Its Application in Solving Poisson's Equation

In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system...

متن کامل

Parallel Iterated Runge Kutta Methods and Applications

The iterated Runge Kutta IRK method is an iteration scheme for the numerical solu tion of initial value problems IVP of ordinary di erential equations ODEs that is based on a predictor corrector method with an Runge Kutta RK method as corrector Embed ded approximation formulae are used to control the stepsize We present di erent parallel algorithms of the IRK method on distributed memory multip...

متن کامل

Dual Schur method in time for nonlinear ODE

We developed parallel time domain decomposition methods to solve systems of linear ordinary differential equations (ODEs) based on the Aitken-Schwarz [5] or primal Schur complement domain decomposition methods [4]. The methods require the transformation of the initial value problem in time defined on ]0,T ] into a time boundary values problem. Let f (t,y(t)) be a function belonging to C 1(R+,Rd...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009